Comonotone lower probabilities with robust marginal distributions functions

نویسندگان

چکیده

Abstract One of the usual dependence structures between random variables is comononicity, which refers to that increase or decrease simultaneously. Besides good mathematical properties, comonotonicity has been applied in choice theory under risk finance, among many other fields. The problem arises when marginal distribution functions are only partially known, hence we know bounds their values. This can be mathematically modelled using p-boxes, allowing us build a bridge with imprecise probabilities. paper investigates existence, construction and uniqueness joint (imprecise) comonotone model given p-boxes. In particular, not unique it exists, follow philosophy probability characterise conditions there exists least-committal model, called natural extension.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comonotone lower probabilities for bivariate and discrete structures

Two random variables are called comonotone when there is an increasing relation between them, in the sense that when one of them increases (decreases), the other one also increases (decreases). This notion has been widely investigated in probability theory, and is related to the theory of copulas. This contribution studies the notion of comonotonicity in an imprecise setting. We define comonoto...

متن کامل

New Distributions for Modeling Subjective Lower and Upper Probabilities

This paper presents an investigation of approaches to modeling lower and upper subjective probabilities. A relatively unexplored approach is introduced, based on the fact that every cumulative distribution function (CDF) with support (0,1) has a “dual” CDF that obeys the conjugacy relation between coherent lower and upper probabilities. A new 2-parameter family of “CDF-Quantile” distributions w...

متن کامل

Learning unbelievable marginal probabilities

Loopy belief propagation performs approximate inference on graphical models with loops. One might hope to compensate for the approximation by adjusting model parameters. Learning algorithms for this purpose have been explored previously, and the claim has been made that every set of locally consistent marginals can arise from belief propagation run on a graphical model. On the contrary, here we...

متن کامل

Novel Bounds on Marginal Probabilities

We derive two related novel bounds on single-variable marginal probability distributions in factor graphs with discrete variables. The first method propagates bounds over a subtree of the factor graph rooted in the variable, and the second method propagates bounds over the self-avoiding walk tree starting at the variable. By construction, both methods not only bound the exact marginal probabili...

متن کامل

Exploiting Ib Assignments for Approximating Marginal Probabilities Exploiting Ib Assignments for Approximating Marginal Probabilities

Computing marginal probabilities (whether prior or posterior) in Bayesian belief networks is a hard problem. This paper discusses deterministic approximation schemes that work by adding up the probability mass in a small number of value assignments to the network variables. Under certain assumptions, the probability mass in the union of these assignments is su cient to obtain a good approximati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revista De La Real Academia De Ciencias Exactas Fisicas Y Naturales Serie A-matematicas

سال: 2022

ISSN: ['1578-7303', '1579-1505']

DOI: https://doi.org/10.1007/s13398-022-01273-x